Finite Soft Decision Data Combining for Decoding of Product Codes With Convolutional Codes as Horizontal Codes
نویسندگان
چکیده
منابع مشابه
Soft Decision Decoding of Reed-Solomon Product Codes
Reed-Solomon codes are a class of non-binary cyclic codes which have strong burst and erasure error correction capabilities. Their current uses include deep-space communications, compact disc recordings, cellular communications, and digital broadcast[1]. Their popularity stems in part from the existence of encoding and decoding algorithms that are simple to implement in hardware. In addition to...
متن کاملBounded-Distance Soft Decision Decoding of Binary Product Codes
A. two-step sub-optimal algorithm for decoding binary product codes is discussed. This algorithm realizes at least half the minimum Euclidean distance of the code. The fundamental geometric properties associated with the algorithm are investigated, and bounds on the number of nearest neighbors are derived. This investigation also results with an improved algorithm which achieves the minimum eff...
متن کاملIterative Soft Permutation Decoding of Product Codes
In this paper the performance of product codes based on quadratic residue codes is investigated. Our Proposed Iterative decoding SISO based on a soft permutation decoding algorithm (SPDA) as a component decoder. Numerical result for the proposed algorithm over Additive White Gaussian Noise (AWGN) channel is provided. Results show that the turbo effect of the proposed decoder algorithm is establ...
متن کامل"Soft-decision" Decoding of Chinese Remainder Codes
Given n relatively prime integers p1 < · · · < pn and an integer k < n, the Chinese Remainder Code, CRTp1,...,pn;k, has as its message space M = {0, . . . , ∏k i=1 pi − 1}, and encodes a message m ∈ M as the vector 〈m1, . . . ,mn〉, where mi = m(mod pi). The soft-decision decoding problem for the Chinese remainder code is given as input a vector of residues ~r = 〈r1, . . . , rn〉, a vector of wei...
متن کاملSoft-decision decoding using punctured codes
Let a -ary linear ( )-code be used over a memoryless channel. We design a soft-decision decoding algorithm that tries to locate a few most probable error patterns on a shorter length [ ]. First, we take cyclically consecutive positions starting from any initial point. Then we cut the subinterval of length into two parts and examine most plausible error patterns on either part. To obtain codewor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Korean Institute of Communications and Information Sciences
سال: 2012
ISSN: 1226-4717
DOI: 10.7840/kics.2012.37.7a.512